Your selections:
On equality in an upper bound for the equivalence domination number
- Arumugam, S., Sundarakannan, M.
Visual cryptography scheme for graphs with vertex covering number two
- Arumugam, S., Lakshmanan, R., Nagar, A.K.
On the parameterized complexity of multiple-interval graph problems
- Fellows, Michael R., Hermelin, Danny, Rosamond, Frances, Vialette, Stéphane
Are you sure you would like to clear your session, including search history and login status?